Interfacing Coq + SSReflect with GAP
نویسندگان
چکیده
We report on an extendable implementation of the communication interface connecting Coq proof assistant to the computational algebra system GAP using the Symbolic Computation Software Composability Protocol (SCSCP). It allows Coq to issue OpenMath requests to a local or remote GAP instances and represent server responses as Coq terms.
منابع مشابه
Machine Learning in Proof General: Interfacing Interfaces
We present ML4PG — a machine learning extension for Proof General. It allows users to gather proof statistics related to shapes of goals, sequences of applied tactics, and proof tree structures from the libraries of interactive higher-order proofs written in Coq and SSReflect. The gathered data is clustered using the state-of-the-art machine learning algorithms available in MATLAB and Weka. ML4...
متن کاملProof Pattern Search in Coq/SSReflect
ML4PG is an extension of the Proof General interface of Coq, allowing the user to invoke machine-learning algorithms and find proof similarities in Coq/SSReflect libraries. In this talk, we will show the recent ML4PG features in action, using examples from the standard SSReflect library and HoTT library. We will compare ML4PG with traditional Coq searching tools and dependency graphs.
متن کاملA Library for Algorithmic Game Theory in Ssreflect/Coq
We report on the formalization in Ssreflect/Coq of a number of concepts and results from algorithmic game theory, including potential games, smooth games, solution concepts such as Pure and Mixed Nash Equilibria, Coarse Correlated Equilibria, -approximate equilibria, and behavioral models of games such as better-response dynamics. We apply the formalization to prove Price of Stability bounds fo...
متن کاملFormalising Sylow's theorems in Coq
This report presents a formalisation of Sylow’s theorems done in Coq. The formalisation has been done in a couple of weeks on top of Georges Gonthier’s ssreflect [2]. There were two ideas behind formalising Sylow’s theorems. The first one was to get familiar with Georges way of doing proofs. The second one was to contribute to the collective effort to formalise a large subset of group theory in...
متن کاملFormally-Proven Kosaraju’s algorithm
This notes explains how the Kosaraju’s algorithm that computes the strong-connected components of a directed graph has been formalised in the Coq prover using the SSReflect extension.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 285 شماره
صفحات -
تاریخ انتشار 2012